Large-scale join-idle-queue system with general service times

Join-Idle-Queue with Service Elasticity: Large-Scale Asymptotics of a Non-monotone System

We consider the model of a token-based joint auto-scaling and load balancing strategy, proposed in a recent paper by Mukherjee, Dhara, Borst, and van Leeuwaarden [20] (SIGMETRICS ’17), which offers an efficient scalable implementation and yet achieves asymptotically optimal steady-state delay performance and energy consumption as the number of servers N→∞. In the above work, the asymptotic resu...

Distributed Join-the-Idle-Queue for Low Latency Cloud Services

Low latency is highly desirable for cloud services. To achieve low response time, stringent timing requirements are needed for task scheduling in a large-scale server farm spanning thousands of servers. In this paper, we conduct an in-depth analysis for distributed Join-the-Idle-Queue (JIQ), a promising new approximation of an idealized task-scheduling algorithm. In particular, we derive semi-c...

Large Deviations for Join the Shorter Queue

A General Class of Closed Fork and Join Queues with Subexponential Service Times

For a general class of closed feedforward fork and join queueing networks, we derive the tail asymptotics of transient cycle times and waiting times under the assumption that the service time distribution of at least one station is subexponential. We also argue that under certain conditions the asymptotic tail distributions remain the same for stationary cycle times and waiting times.

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.